/**
 * TODO 使用递归实现链表的增删改查操作
 */
public class LinkedListR<E> {

    private Node dummyHead;
    private int size;

    public LinkedListR() {
        dummyHead = new Node(-1, null);
        size=  0;
    }

    private class Node<E> {
        public E e;
        public Node next;

        public Node() {
            this(null, null);
        }

        public Node(E e) {
            this(e, null);
        }

        public Node(E e, Node next) {
            this.e = e;
            this.next = next ;
        }

        @Override
        public String toString() {
            return e.toString();
        }
    }
}
